Polar spaces, generalized hexagons and perfect codes
نویسندگان
چکیده
منابع مشابه
A Note on Finite Self-Polar Generalized Hexagons and Partial Quadrangles
In 1976, Cameron et al. [2] proved that, if a finite generalized hexagon of order s admits a polarity, then either s or 3s is a perfect square. Their proof used standard eigenvalue arguments. Later on, Ott [3] showed that for a self polar finite thick generalized hexagon of order s, 3s always has to be a perfect square. His proof used Hecke algebras. It was surprising that one had to use this m...
متن کاملDiscrete configuration spaces of squares and hexagons
We consider generalizations of the familiar fifteen-piece sliding puzzle on the 4 by 4 square grid. On larger grids with more pieces and more holes, asymptotically how fast can we move the puzzle into the solved state? We also give a variation with sliding hexagons. The square puzzles and the hexagon puzzles are both discrete versions of configuration spaces of disks, which are of interest in s...
متن کاملPrimitive flag-transitive generalized hexagons and octagons
Suppose that an automorphism group G acts flag-transitively on a finite generalized hexagon or octagon S, and suppose that the action on both the point and line set is primitive. We show that G is an almost simple group of Lie type, that is, the socle of G is a simple Chevalley group.
متن کاملExtended Generalized Hexagons and the Suzuki Chain
Four extended generalized hexagons related to the simple groups G2(2)', PSU4(3), HJ and Suz are characterized by the condition that any triple of points {x, y, z) is a clique of the point graph not in a circle of the extended hexagon if and only if the distance of y and z in the residue at x is 3.
متن کاملA generalized concatenation construction for q-ary 1-perfect codes
We consider perfect 1-error correcting codes over a finite field with q elements (briefly q-ary 1-perfect codes). In this paper, a generalized concatenation construction for q-ary 1-perfect codes is presented that allows us to construct q-ary 1-perfect codes of length (q − 1)nm + n +m from the given q-ary 1-perfect codes of length n = (q1 − 1)/(q − 1) and m = (q2 − 1)/(q − 1), where s1, s2 are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1980
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90049-7